Intrinsic Run-Time Row Hammer PUFs: Leveraging the Row Hammer Effect for Run-Time Cryptography and Improved Security †
نویسندگان
چکیده
منابع مشابه
Coping with Resource Fluctuations: The Run-time Reconfigurable Functional Unit Row Classifier Architecture
The evolvable hardware paradigm facilitates the construction of autonomous systems that can adapt to environmental changes and degrading effects in the computational resources. Extending these scenarios, we study the capability of evolvable hardware classifiers to adapt to intentional run-time fluctuations in the available resources, i.e., chip area, in this work. To that end, we leverage the F...
متن کاملRun-Time Security Traceability for Evolving Systems1
Security-critical systems are challenging to design and implement correctly and securely. A lot of vulnerabilities have been found in current software systems both at the specification and the implementation levels. This paper presents a comprehensive approach for model-based security assurance. Initially, it allows one to formally verify the design models against high-level security requiremen...
متن کاملRun-Time Security Traceability for Evolving Systems
(2011). Run-time security traceability for evolving systems. Security-critical systems are challenging to design and implement correctly and securely. A lot of vulnerabilities have been found in current software systems both at the specification and the implementation levels. This paper presents a comprehensive approach for model-based security assurance. Initially, it allows one to formally ve...
متن کاملRun-Time Accessible DRAM PUFs in Commodity Devices
A Physically Unclonable Function (PUF) is a unique and stable physical characteristic of a piece of hardware, which emerges due to variations in the fabrication processes. Prior works have demonstrated that PUFs are a promising cryptographic primitive to enable secure key storage, hardware-based device authentication and identification. So far, most PUF constructions require addition of new har...
متن کاملRun Time Compile Time Compile − time Specialization Run − time
Because of its wide applicability, many eecient implementations of the Fast Fourier Transform have been developed. We propose that an eecient implementation can be produced automatically and reliably by partial evaluation. Partial evaluation of an unoptimized implementation produces a speedup of over 9 times. The automatically generated result of partial evaluation has performance comparable to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography
سال: 2018
ISSN: 2410-387X
DOI: 10.3390/cryptography2030013